Single Rules form Canonical Logic Programs
نویسنده
چکیده
It has been conjectured [Blair] that every definite clause logic program containing exactly one rule is canonical. This note presents a simple proof
منابع مشابه
Programming in logic without logic programming
In previous work, we proposed a logic-based framework in which computation is the execution of actions in an attempt to make reactive rules of the form if antecedent then consequent true in a canonical model of a logic program determined by an initial state, sequence of events, and the resulting sequence of subsequent states. In this model-theoretic semantics, reactive rules are the driving for...
متن کاملStratified Probabilistic Description Logic Programs
In previous work, we have introduced probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set and well-founded semantics with Poole’s independent choice logic. Such programs are directed towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules...
متن کاملNegation Without Negation in Probabilistic Logic Programming
Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...
متن کاملA general theory of confluent rewriting systems for logic programming and its applications
Recently, Brass and Dix showed (Journal of Automated Reasoning 20(1), 1998) that the wellfounded semantics WFS can be deened as a connuent calculus of transformation rules. This lead not only to a simple extension to disjunctive programs (Journal of Logic Programming 38(3), 1999), but also to a new computation of the wellfounded semantics which is linear for a broad class of programs. We take t...
متن کاملOn the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz’s answer sets semantics (initially defined as ‘stable model semantics’). This paper introduces a fundamental result, which is very relevant for Answer Set programming, and planning. For the first time since the definition of the stable model semantics, the class of logic programs for which a...
متن کامل